Performance and scalability of indexed subgraph query processing methods
نویسندگان
چکیده
منابع مشابه
Performance and Scalability of Indexed Subgraph Query Processing Methods
Graph data management systems have become very popular as graphs are the natural data model for many applications. One of the main problems addressed by these systems is subgraph query processing; i.e., given a query graph, return all graphs that contain the query. The naive method for processing such queries is to perform a subgraph isomorphism test against each graph in the dataset. This obvi...
متن کاملTaming Subgraph Isomorphism for RDF Query Processing
RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching. There have been two completely different directions for supporting efficient subg...
متن کاملHandling Resource Constraints and Scalability in Continuous Query Processing
HANDLING RESOURCE CONSTRAINTS AND SCALABILITY IN CONTINUOUS QUERY PROCESSING by
متن کاملLabelling-Scheme-based Subgraph Query Processing on Graph Data
When data are modeled as graphs, many research issues arise. In particular, there are many new challenges in query processing on graph data. This chapter studies the problem of structural queries on graph data. A hash-based structural join algorithm, HGJoin, is first proposed to handle reachability queries on graph data. Then, it is extended to the algorithms to process structural queries in fo...
متن کاملPRAGUE: A Practical Framework for Blending Visual Subgraph Query Formulation and Query Processing
In a previous paper, we laid out the vision of a novel graph query processing paradigm where instead of processing a visual query graph after its construction, it interleaves visual query formulation and processing by exploiting the latency offered by the GUI to filter irrelevant matches and prefetch partial query results [10]. Our first attempt at implementing this vision, called GBLENDER [10]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2015
ISSN: 2150-8097
DOI: 10.14778/2824032.2824054